- Title
- The trip scheduling problem
- Creator
- Archetti, Claudia; Savelsbergh, Martin
- Relation
- Transportation Science Vol. 43, Issue 4, p. 417-431
- Publisher Link
- http://dx.doi.org/10.1287/trsc.1090.0278
- Publisher
- Institute for Operations Research and the Management Sciences (INFORMS)
- Resource Type
- journal article
- Date
- 2009
- Description
- The hours of service (HOS) regulations of the department of transportation severely restrict the set of feasible driver schedules. So much so that establishing whether a sequence of full truckload transportation requests, each with a dispatch window at the origin, can feasibly be executed by a driver is no longer a matter of simple forward simulation. We consider this problem and prove that the feasibility of a driver schedule can be checked in polynomial time by providing an O(n³) algorithm for establishing whether a sequence of full truckload transportation requests, each with a dispatch window at the origin, can be executed by a driver.
- Subject
- truckload transportation; driver scheduling; hours of service; dispatch windows
- Identifier
- http://hdl.handle.net/1959.13/937672
- Identifier
- uon:12598
- Identifier
- ISSN:1526-5447
- Language
- eng
- Reviewed
- Hits: 413
- Visitors: 659
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|